APPROXIMATION FOR DENSITY OF ESTIMATORS IN GAUSSIAN AR (1) PROCESS
نویسندگان
چکیده
منابع مشابه
Laplace Approximation for Logistic Gaussian Process Density Estimation and Regression
Logistic Gaussian process (LGP) priors provide a flexible alternative for modelling unknown densities. The smoothness properties of the density estimates can be controlled through the prior covariance structure of the LGP, but the challenge is the analytically intractable inference. In this paper, we present approximate Bayesian inference for LGP density estimation in a grid using Laplace’s met...
متن کاملDensity Estimators for Truncated Dependent Data
In some long term studies, a series of dependent and possibly truncated lifetime data may be observed. Suppose that the lifetimes have a common continuous distribution function F. A popular stochastic measure of the distance between the density function f of the lifetimes and its kernel estimate fn is the integrated square error (ISE). In this paper, we derive a central limit theorem for t...
متن کاملMultiresolution Kernel Approximation for Gaussian Process Regression
(a) (b) (c) Figure: (a) In a simple blocked low rank approximation the diagonal blocks are dense (gray), whereas the off-diagonal blocks are low rank. (b) In an HODLR matrix the low rank off-diagonal blocks form a hierarchical structure leading to a much more compact representation. (c) H2 matrices are a refinement of this idea. (a) In simple blocked low rank approximation the diagonal blocks a...
متن کاملHierarchically-partitioned Gaussian Process Approximation
The Gaussian process (GP) is a simple yet powerful probabilistic framework for various machine learning tasks. However, exact algorithms for learning and prediction are prohibitive to be applied to large datasets due to inherent computational complexity. To overcome this main limitation, various techniques have been proposed, and in particular, local GP algorithms that scales ”truly linearly” w...
متن کاملAdaptive Gaussian Predictive Process Approximation
We address the issue of knots selection for Gaussian predictive process methodology. Predictive process approximation provides an effective solution to the cubic order computational complexity of Gaussian process models. This approximation crucially depends on a set of points, called knots, at which the original process is retained, while the rest is approximated via a deterministic extrapolati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF THE JAPAN STATISTICAL SOCIETY
سال: 1996
ISSN: 1882-2754,1348-6365
DOI: 10.14490/jjss1995.26.161